منابع مشابه
Solution of Large-size Problems Through A
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint. All coefficients are assumed to be nonnegative and all decision variables are binary. A new exact algorithm is presented, which makes use of aggressive reduction techniques to decrease the size of the instance to a manageable size. A cascade of upper bounds is used for the ...
متن کاملMajority and Plurality Problems
Given a set of n balls each colored with a color, a ball is said to be majority, kmajority, plurality if its color class has size larger than half of the number of balls, has size at least k, has size larger than any other color class; respectively. We address the problem of finding the minimum number of queries (a comparison of a pair of balls if they have the same color or not) that is needed...
متن کاملOptimal Query Time for Encoding Range Majority
We revisit the range τ -majority problem, which asks us to preprocess an array A[1..n] for a fixed value of τ ∈ (0, 1/2], such that for any query range [i, j] we can return a position in A of each distinct τ majority element. A τ -majority element is one that has relative frequency at least τ in the range [i, j]: i.e., frequency at least τ(j − i + 1). Belazzougui et al. [WADS 2013] presented a ...
متن کاملA family of large set of size nine
We investigate the existence of some large sets of size nine. The large set $LS[9](2,5,29)$ is constructed and existence of the family $LS[9](2,5,27l+j)$ for $lgeq 1, 2leq j
متن کاملValiant’s Polynomial-Size Monotone Formula for Majority
The existence of polynomial-size (monotone) formulae is known to be equivalent to the existence of logarithmic-depth (monotone) circuits of bounded fan-in. Anyhow, we shall prove the existence of logarithmic-depth monotone formulae (of bounded fan-in) for majority. Actually, two radically different proofs are known: The first proof uses a rather complicated construction of sorting networks of l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.015